A GAPN Approach for the Flexible Job-Shop Scheduling Problem with Indirect Energy and Time-of-Use Electricity Pricing
نویسندگان
چکیده
The flexible job-shop scheduling problem with indirect energy and time-of-use (ToU) electricity pricing (FJSP-IT) is investigated. Considering the production cost, which includes direct cost time evaluation model under ToU built. To minimize total of FJSP-IT, an approach based on a genetic algorithm Petri nets (GAPN) presented. Under this approach, are modeled net (PN) nodes, operation evaluated through PN simulation, resource allocation fine-tuned operations. A group heuristic policies, especially exhausting subsection policy two mixed presented to adapt FJSP-IT vague components. Experiments were performed data set generated from banburying shop rubber tire plant, results show that proposed GAPN has good convergence. Using policies makes it possible save 10.81% compared using single off-peak first or passive delay policy, considering at least 2.09% ignoring energy.
منابع مشابه
Solving Flexible Job Shop Scheduling with Multi Objective Approach
In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Pareto-optima...
متن کاملA New model for integrated lot sizing and scheduling in flexible job shop problem
In this paper an integrated lot-sizing and scheduling problem in a flexible job shop environment with machine-capacity-constraint is studied. The main objective is to minimize the total cost which includes the inventory costs, production costs and the costs of machine’s idle times. First, a new mixed integer programming model,with small bucket time approach,based onProportional Lot sizing and S...
متن کاملCritical Path Method for Flexible Job Shop Scheduling Problem with Preemption
This paper addressed a Flexible Job shop Scheduling Problem (FJSP) with the objective of minimization of maximum completion time (Cmax) which job splitting or lot streaming is allowed. Lot streaming is an important technique that has been used widely to reduce completion time of a production system. Due to the complexity of the problem; exact optimization techniques such as branch and bound alg...
متن کاملGenetic algorithm for the flexible job-shop scheduling problem
In this paper, we propose a new optimization technique, the hierarchical multi-space competitive distributed genetic algorithm (HmcDGA), which is effective for the hierarchical optimization problem. It is an extension of the multi-space competitive distributed genetic algorithm (mcDGA), which was proposed by the authors. The mcDGA efficiently finds an optimal solution with a low computational c...
متن کاملIterative Flattening Search for the Flexible Job Shop Scheduling Problem
This paper presents a meta-heuristic algorithm for solving the Flexible Job Shop Scheduling Problem (FJSSP). This strategy, known as Iterative Flattening Search (IFS), iteratively applies a relaxationstep, in which a subset of scheduling decisions are randomly retracted from the current solution; and a solving-step, in which a new solution is incrementally recomputed from this partial schedule....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Processes
سال: 2022
ISSN: ['2227-9717']
DOI: https://doi.org/10.3390/pr10050832